New Net Models for Spectral Netlist Partitioning
نویسندگان
چکیده
Spectral approaches for partitioning netlists that use the eigenvectors of a matrix derived from a weighted graph model of the netlist(hypergraph) have been attracting considerable atttention. There are several known ways in which a weighted graph could be derived from the netlist. However, the effectiveness of these alternate net models for netlist partitioning has remained unexplored. In this paper we first evaluate the relative performance of these approaches and establish that the quality of the partition is sensitive to the choice of the model. We also propose and investigate a number of new approaches for deriving a weighted graph model for a netlist.We show through test reslults on benchmark partitioning problems that one of the new models proposed here, performs consistently better than all the other
منابع مشابه
5 Conclusion and Future Directions
We have introduced fast and eeective k-way partitioning solutions for the two regimes k n and k = (n). Our contributions include a new \partitioning-speciic" net model used in constructing the Laplacian of the netlist, the use of fast Lanczos implementations to compute the d-dimensional geometric embedding eeciently, and a careful choice of geometric clustering objectives and algorithms. We bel...
متن کاملMulti-Way Partitioning Via Space lling Curves and Dynamic Programming
Spectral geometric embeddings of a circuit netlist can lead to fast, high quality multi-way partitioning solutions. Furthermore, it has been shown that d-dimensional spectral embeddings (d > 1) are a more powerful tool than single-eigenvector embeddings (d = 1) for multi-way partitioning [2] [4]. However, previous methods cannot fully utilize information from the spectral embedding while optimi...
متن کاملKc 34.6 33.6 34.4 30.7 27.5 16.4 17.4 13.5
Spectral geometric embeddings of a circuit netlist can lead to fast, high quality multi-way partitioning solutions. Furthermore, it has been shown that d-dimensional spectral embeddings (d > 1) are a more powerful tool than single-eigenvector embeddings (d = 1) for multi-way partitioning [2] [4]. However, previous methods cannot fully utilize information from the spectral embedding while optimi...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کاملNew spectral methods for ratio cut partitioning and clustering
Partitioning of circuit netlists is important in many phases of VLSI design, ranging from layout to testing and hardware simulation. The ratio cut objective function [29] has received much attention since it naturally captures both mincut and equipartition, the two traditional goals of partitioning. In this paper, we show that the second smallest eigenvalue of a matrix derived from the netlist ...
متن کامل